Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information

نویسندگان

  • Yigal Bejerano
  • Joseph Naor
  • Alexander Sprintson
چکیده

We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection uses a primary path to deliver packets from the source to the destination. To ensure continuous operation in the event of an edge failure, each connection uses a set of backup bridges, each bridge protecting a portion of the primary path. To meet the bandwidth requirement of the connection, a certain amount of bandwidth must be allocated the edges of the primary path, as well as on the backup edges. In this paper, we focus on minimizing the amount of required backup allocation by sharing backup bandwidth among different connections. We consider efficient sharing schemes that require only partial information about the current state of the network. Specifically, the only information available for each edge is the total amount of primary allocation and the cost of allocating backup bandwidth on this edge. We consider the problem of finding a minimum cost backup allocation together with a set of bridges for a given primary path. We prove that this problem is NP-hard and present an approximation algorithm whose performance is within O (log n) of the optimum, where n is the number of edges in the primary path. We also consider the problem of finding both a primary path and backup allocation of minimal total cost. ∗A preliminary version of this paper appears in the Proceedings of 13th Annual European Symposium on Algorithms ESA 2005, Mallorca, Spain. J. (Seffi) Naor: This research is supported in part by a foundational and strategical research grant from the Israeli Ministry of Science, and by a US-Israel BSF Grant 2002276. Y. Bejerano Bell Labs, Lucent Technologies, Murray Hill, NJ 07974, USA e-mail: [email protected] J. (Seffi) Naor Department of Computer Science, Technion-Israel Institute of Technology, Haifa 32000 Israel e-mail: [email protected] A. Sprintson ( ) Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843 e-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II

This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows that a heuristic algorithm can also have better overall performance than its time-consuming, Integer Linear Programming (ILP) based counterparts in the online case, which is non-intuitive. The proposed heuristic algorithm ...

متن کامل

Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part I

This paper describes a novel framework, called Distributed Partial Information Management (or DPIM). It addresses several major challenges in achieving efficient shared path protection under distributed control with only partial information, including (1) how much partial information about existing active and backup paths (or APs and BPs respectively) is maintained and exchanged; (2) how to obt...

متن کامل

Efficient channel reservation for backup paths in optical mesh networks

In an optical mesh network, backup channels are shared between multiple lightpaths to reduce restoration capacity overhead. The sharability of channels is usually constrained by the mandate to provide 100% recovery of all lightpaths affected by any single event failure in the network. This paper proposes a pool based channel reservation scheme that is optimal when the set of primary and backup ...

متن کامل

Capacity efficient distributed routing of mesh-restored lightpaths in optical networks

A mesh-restored lightpath in an optical network has a primary route and a diversely routed backup route. The wavelength channels on the primary route of a mesh-restored lightpath are dedicated for that lightpath whereas the wavelength channels on the backup route are shared among different mesh-restored lightpaths. Wavelength channels are shared in a way that ensures restoration of all lightpat...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Optim.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2005